dining philosophers problem
- dining philosophers problem
-
проблема обедающих философов; проблема распределения ресурсов и исключения тупиков
Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. .
1998-2007.
Смотреть что такое "dining philosophers problem" в других словарях:
Dining philosophers problem — In computer science, the dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues and techniques for resolving them. It was originally formulated in 1965 by Edsger Dijkstra… … Wikipedia
Dining philosophers problem — Aufbau des Philosophenproblems Es handelt sich bei dem Philosophenproblem (engl. Dining Philosophers Problem) um ein Fallbeispiel aus dem Bereich der Theoretischen Informatik. Dabei soll das Problem der Nebenläufigkeit erklärt werden, und die… … Deutsch Wikipedia
Dining cryptographers problem — In cryptography, the dining cryptographers problem studies how to perform a secure multi party computation of the boolean OR function. David Chaum first proposed this problem in 1988, and used it as an illustrative example to show it was possible … Wikipedia
Producer-consumer problem — In computer science, the producer consumer problem (also known as the bounded buffer problem) is a classical example of a multi process synchronization problem. The problem describes two processes, the producer and the consumer, who share a… … Wikipedia
Sleeping barber problem — In computer science, the sleeping barber problem is a classic inter process communication and synchronization problem between multiple operating system processes. The problem is analogous to that of keeping a barber working when there are… … Wikipedia
Readers-writers problem — In computer science, the first and second readers writers problems are examples of a common computing problem in concurrency. The two problems deal with situations in which many threads must access the same shared memory at one time, some reading … Wikipedia
Rendezvous problem — The rendezvous dilemma is related to the prisoner s dilemma and can be formulated in this way::Two young people have a date in a park they have never been to before. Arriving separately in the park, they are both surprised to discover that it is… … Wikipedia
Speisende Philosophen — Aufbau des Philosophenproblems Es handelt sich bei dem Philosophenproblem (engl. Dining Philosophers Problem) um ein Fallbeispiel aus dem Bereich der Theoretischen Informatik. Dabei soll das Problem der Nebenläufigkeit erklärt werden, und die… … Deutsch Wikipedia
Philosophenproblem — Aufbau des Philosophenproblems Beim Philosophenproblem (engl. Dining Philosophers Problem) handelt es sich um ein Fallbeispiel aus dem Bereich der Theoretischen Informatik. Damit soll das Problem der Nebenläufigkeit erklärt werden und die Gefahr… … Deutsch Wikipedia
Semaphore (programming) — For other uses, see Semaphore (disambiguation). In computer science, a semaphore is a variable or abstract data type that provides a simple but useful abstraction for controlling access by multiple processes to a common resource in a parallel… … Wikipedia
Проблема обедающих философов — «Проблема обедающих философов» классический пример, используемый в информатике для иллюстрации проблем синхронизации в дизайне параллельных алгоритмов и техник решения этих проблем. Проблема была сформулирована в 1965 году Эдсгером… … Википедия
